Sparse B-spline polynomial descriptors for human activity recognition

نویسندگان

  • Antonios Oikonomopoulos
  • Maja Pantic
  • Ioannis Patras
چکیده

Article history: Received 19 May 2008 Received in revised form 10 April 2009 Accepted 16 May 2009

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Human Gesture Recognition using Sparse B-spline Polynomial Representations

The extraction and quantization of local image and video descriptors for the subsequent creation of visual codebooks is a technique that has proved extremely effective for image and video retrieval applications. In this paper we build on this concept and extract a new set of visual descriptors that are derived from spatiotemporal salient points detected on given image sequences and provide loca...

متن کامل

NON-POLYNOMIAL SPLINE SOLUTIONS FOR SPECIAL NONLINEAR FOURTH-ORDER BOUNDARY VALUE PROBLEMS

We present a sixth-order non-polynomial spline method for the solutions of two-point nonlinear boundary value problem u(4)+f(x,u)=0, u(a)=α1, u''(a)= α2, u(b)= β1,u''(b)= β2, in off step points. Numerical method of sixth-order with end conditions of the order 6 is derived. The convergence analysis of the method has been discussed. Numerical examples are presented to illustrate the applications ...

متن کامل

INTERPOLATION BY HYPERBOLIC B-SPLINE FUNCTIONS

In this paper we present a new kind of B-splines, called hyperbolic B-splines generated over the space spanned by hyperbolic functions and we use it to interpolate an arbitrary function on a set of points. Numerical tests for illustrating hyperbolic B-spline are presented.

متن کامل

Face Recognition in Thermal Images based on Sparse Classifier

Despite recent advances in face recognition systems, they suffer from serious problems because of the extensive types of changes in human face (changes like light, glasses, head tilt, different emotional modes). Each one of these factors can significantly reduce the face recognition accuracy. Several methods have been proposed by researchers to overcome these problems. Nonetheless, in recent ye...

متن کامل

Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements

The multi-frontal direct solver is the state-of-the-art algorithm for the direct solution of sparse linear systems. This paper provides computational complexity and memory usage estimates for the application of the multifrontal direct solver algorithm on linear systems resulting from B-spline-based isogeometric finite elements, where the mesh is a structured grid. Specifically we provide the es...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Image Vision Comput.

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2009